On Non-local Propositional and Weak Monodic Quantified
نویسنده
چکیده
In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional , in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified , where the next-time operator can be applied only to formulas with at most one free variable, all other temporal operators and path quantifiers are applicable only to sentences, and the first-order constructs follow the pattern of any of several decidable fragments of first-order logic.
منابع مشابه
On Non-local Propositional and Weak Monodic Quantified CTL
In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional PCTL∗, in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified PCTL∗, where the next-time operator can be applied only to formulas with at mo...
متن کاملMonodic temporal logic with quantified propositional variables
We extend the monodic fragment of first-order linear temporal logic to include right-linear grammar operators and quantification of propositional variables. Unlike propositional temporal logic, the use of grammar operators in first-order temporal logic is not equivalent to general propositional quantification, as the latter admit satisfiable formulae without countable models. We consider the de...
متن کاملInteractions between Time and Knowledge in a First-order Logic for Multi-Agent Systems
We investigate a class of first-order temporal epistemic logics for the specification of multi-agent systems. We consider well-known properties of multi-agent systems including perfect recall, synchronicity, no learning, unique initial state, and define natural correspondences between these and quantified interpreted systems. Our findings identify several monodic fragments of first-order tempor...
متن کاملComplexity of monodic guarded fragments over linear and real time
Propositional temporal logic is now well established, both in its theory and its utility for practical applications in computing. In contrast, predicate, or first-order, temporal logic has been less studied. Unpublished results of Lindström and Scott in the 1960s showed that even weak fragments of first-order temporal logic are highly undecidable, and these and later similar results (see, e.g.,...
متن کاملExploring the Monodic Fragment of First-Order Temporal Logic using Clausal Temporal Resolution
Until recently, first-order temporal logic has been little understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not available. However, a breakthrough by Hodkinson et.al., identifying a finitely axiomatisable fragment, termed the monodic fragment, has led to improved understanding of first-order temporal logi...
متن کامل